Clustering via the Bayesian information criterion with applications in speech recognition

One difficult problem we are often faced with in clustering analysis is how to choose the number of clusters. In this paper, we propcse to choose the number of clusters by optimizing the Bq2yesian information criterion (BIC), a model selection criierion in the statistics literature. We develop a termination criterion for the hierarchical clustering methods which optimizes the BIC criterion in a greedy fashion. The resulting algorithms are fully automatic. Our experiments on Gaussian mixture modeling and speaker clustering demonstrate that the BIC criterion is able to choose the number of clusters according to the intrinsic complexity present in the data.